0.11/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.11/0.12 % Command : run_E %s %d THM 0.12/0.32 % Computer : n012.cluster.edu 0.12/0.32 % Model : x86_64 x86_64 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.32 % Memory : 8042.1875MB 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.32 % CPULimit : 1440 0.12/0.32 % WCLimit : 180 0.12/0.32 % DateTime : Thu Jul 4 08:59:54 EDT 2024 0.12/0.32 % CPUTime : 0.19/0.46 Running higher-order theorem proving 0.19/0.47 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox2/tmp/tmp.66usXEmDFN/E---3.1_23360.p 1.24/0.62 # Version: 3.2.0-ho 1.24/0.62 # Preprocessing class: HSSSSLSSSLSNSFA. 1.24/0.62 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 1.24/0.62 # Starting post_as_ho5 with 900s (5) cores 1.24/0.62 # Starting post_as_ho10 with 180s (1) cores 1.24/0.62 # Starting post_as_ho4 with 180s (1) cores 1.24/0.62 # Starting sh5l with 180s (1) cores 1.24/0.62 # post_as_ho5 with pid 23438 completed with status 0 1.24/0.62 # Result found by post_as_ho5 1.24/0.62 # Preprocessing class: HSSSSLSSSLSNSFA. 1.24/0.62 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 1.24/0.62 # Starting post_as_ho5 with 900s (5) cores 1.24/0.62 # SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true) 1.24/0.62 # Search class: HGUPS-FFSF21-MSFFMSNN 1.24/0.62 # Scheduled 5 strats onto 5 cores with 900 seconds (900 total) 1.24/0.62 # Starting post_as_ho10 with 300s (1) cores 1.24/0.62 # Starting post_as_ho5 with 151s (1) cores 1.24/0.62 # Starting post_as_ho4 with 151s (1) cores 1.24/0.62 # Starting new_ho_10_unif with 151s (1) cores 1.24/0.62 # Starting lpo8_s with 147s (1) cores 1.24/0.62 # new_ho_10_unif with pid 23446 completed with status 0 1.24/0.62 # Result found by new_ho_10_unif 1.24/0.62 # Preprocessing class: HSSSSLSSSLSNSFA. 1.24/0.62 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 1.24/0.62 # Starting post_as_ho5 with 900s (5) cores 1.24/0.62 # SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true) 1.24/0.62 # Search class: HGUPS-FFSF21-MSFFMSNN 1.24/0.62 # Scheduled 5 strats onto 5 cores with 900 seconds (900 total) 1.24/0.62 # Starting post_as_ho10 with 300s (1) cores 1.24/0.62 # Starting post_as_ho5 with 151s (1) cores 1.24/0.62 # Starting post_as_ho4 with 151s (1) cores 1.24/0.62 # Starting new_ho_10_unif with 151s (1) cores 1.24/0.62 # Preprocessing time : 0.001 s 1.24/0.62 # Presaturation interreduction done 1.24/0.62 1.24/0.62 # Proof found! 1.24/0.62 # SZS status Theorem 1.24/0.62 # SZS output start CNFRefutation 1.24/0.62 thf(decl_sort1, type, n: $tType). 1.24/0.62 thf(decl_22, type, c0: n). 1.24/0.62 thf(decl_23, type, cS: n > n). 1.24/0.62 thf(decl_24, type, c_plus: n > n > n). 1.24/0.62 thf(decl_25, type, cPA_1: $o). 1.24/0.62 thf(decl_26, type, cPA_2: $o). 1.24/0.62 thf(decl_27, type, cPA_IND_EQ: $o). 1.24/0.62 thf(decl_28, type, esk1_2: (n > n) > (n > n) > n). 1.24/0.62 thf(decl_29, type, esk2_0: n). 1.24/0.62 thf(cPA_THM2, conjecture, (![X1:n]:(((c_plus @ X1 @ c0)=(c_plus @ c0 @ X1)))<=(((cPA_1)&(cPA_2))&(cPA_IND_EQ))), file('/export/starexec/sandbox2/tmp/tmp.66usXEmDFN/E---3.1_23360.p', cPA_THM2)). 1.24/0.62 thf(cPA_IND_EQ_def, axiom, ((cPA_IND_EQ)<=>![X3:n > n, X4:n > n]:(((((X3 @ c0)=(X4 @ c0))&![X1:n]:((((X3 @ X1)=(X4 @ X1))=>((X3 @ (cS @ X1))=(X4 @ (cS @ X1))))))=>![X1:n]:(((X3 @ X1)=(X4 @ X1)))))), file('/export/starexec/sandbox2/tmp/tmp.66usXEmDFN/E---3.1_23360.p', cPA_IND_EQ_def)). 1.24/0.62 thf(cPA_1_def, axiom, ((cPA_1)<=>![X1:n]:(((c_plus @ X1 @ c0)=(X1)))), file('/export/starexec/sandbox2/tmp/tmp.66usXEmDFN/E---3.1_23360.p', cPA_1_def)). 1.24/0.62 thf(cPA_2_def, axiom, ((cPA_2)<=>![X1:n, X2:n]:(((c_plus @ X1 @ (cS @ X2))=(cS @ (c_plus @ X1 @ X2))))), file('/export/starexec/sandbox2/tmp/tmp.66usXEmDFN/E---3.1_23360.p', cPA_2_def)). 1.24/0.62 thf(c_0_4, negated_conjecture, ~((((![X13:n]:(((c_plus @ X13 @ c0)=(X13)))&![X14:n, X15:n]:(((c_plus @ X14 @ (cS @ X15))=(cS @ (c_plus @ X14 @ X15)))))&![X16:n > n, X17:n > n]:(((((X16 @ c0)=(X17 @ c0))&![X18:n]:((((X16 @ X18)=(X17 @ X18))=>((X16 @ (cS @ X18))=(X17 @ (cS @ X18))))))=>![X19:n]:(((X16 @ X19)=(X17 @ X19))))))=>![X1:n]:(((c_plus @ X1 @ c0)=(c_plus @ c0 @ X1))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[cPA_THM2]), cPA_IND_EQ_def]), cPA_1_def]), cPA_2_def])])). 1.24/0.62 thf(c_0_5, negated_conjecture, ![X20:n, X21:n, X22:n, X23:n > n, X24:n > n, X26:n]:((((((c_plus @ X20 @ c0)=(X20))&((c_plus @ X21 @ (cS @ X22))=(cS @ (c_plus @ X21 @ X22))))&((((X23 @ (esk1_2 @ X23 @ X24))=(X24 @ (esk1_2 @ X23 @ X24)))|((X23 @ c0)!=(X24 @ c0))|((X23 @ X26)=(X24 @ X26)))&(((X23 @ (cS @ (esk1_2 @ X23 @ X24)))!=(X24 @ (cS @ (esk1_2 @ X23 @ X24))))|((X23 @ c0)!=(X24 @ c0))|((X23 @ X26)=(X24 @ X26)))))&((c_plus @ esk2_0 @ c0)!=(c_plus @ c0 @ esk2_0)))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])])])). 1.24/0.62 thf(c_0_6, negated_conjecture, ![X1:n, X3:n > n, X4:n > n]:((((X3 @ (esk1_2 @ X3 @ X4))=(X4 @ (esk1_2 @ X3 @ X4)))|((X3 @ X1)=(X4 @ X1))|((X3 @ c0)!=(X4 @ c0)))), inference(split_conjunct,[status(thm)],[c_0_5])). 1.24/0.62 thf(c_0_7, negated_conjecture, ![X1:n]:(((c_plus @ X1 @ c0)=(X1))), inference(split_conjunct,[status(thm)],[c_0_5])). 1.24/0.62 thf(c_0_8, negated_conjecture, ![X1:n, X3:n > n, X4:n > n]:((((X3 @ (esk1_2 @ X3 @ (^[Z0/* 24 */:n]:(c_plus @ (X4 @ Z0) @ Z0))))=(c_plus @ (X4 @ (esk1_2 @ X3 @ (^[Z0/* 24 */:n]:(c_plus @ (X4 @ Z0) @ Z0)))) @ (esk1_2 @ X3 @ (^[Z0/* 24 */:n]:(c_plus @ (X4 @ Z0) @ Z0)))))|((X3 @ X1)=(c_plus @ (X4 @ X1) @ X1))|((X3 @ c0)!=(X4 @ c0)))), inference(spm,[status(thm)],[c_0_6, c_0_7])). 1.24/0.62 thf(c_0_9, negated_conjecture, ![X1:n, X2:n]:(((c_plus @ X1 @ (cS @ X2))=(cS @ (c_plus @ X1 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_5])). 1.24/0.62 thf(c_0_10, negated_conjecture, ((c_plus @ c0 @ (esk1_2 @ (^[Z0/* 0 */:n]:(Z0)) @ (c_plus @ c0)))=(esk1_2 @ (^[Z0/* 0 */:n]:(Z0)) @ (c_plus @ c0))), inference(condense,[status(thm)],[inference(er,[status(thm)],[c_0_8])])). 1.24/0.62 thf(c_0_11, negated_conjecture, ((c_plus @ esk2_0 @ c0)!=(c_plus @ c0 @ esk2_0)), inference(split_conjunct,[status(thm)],[c_0_5])). 1.24/0.62 thf(c_0_12, negated_conjecture, ![X1:n, X3:n > n, X4:n > n]:((((X3 @ X1)=(X4 @ X1))|((X3 @ (cS @ (esk1_2 @ X3 @ X4)))!=(X4 @ (cS @ (esk1_2 @ X3 @ X4))))|((X3 @ c0)!=(X4 @ c0)))), inference(split_conjunct,[status(thm)],[c_0_5])). 1.24/0.62 thf(c_0_13, negated_conjecture, ((c_plus @ c0 @ (cS @ (esk1_2 @ (^[Z0/* 0 */:n]:(Z0)) @ (c_plus @ c0))))=(cS @ (esk1_2 @ (^[Z0/* 0 */:n]:(Z0)) @ (c_plus @ c0)))), inference(spm,[status(thm)],[c_0_9, c_0_10])). 1.24/0.62 thf(c_0_14, negated_conjecture, ((c_plus @ c0 @ esk2_0)!=(esk2_0)), inference(rw,[status(thm)],[c_0_11, c_0_7])). 1.24/0.62 thf(c_0_15, negated_conjecture, ![X1:n]:(((c_plus @ c0 @ X1)=(X1))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12, c_0_13]), c_0_7])])). 1.24/0.62 thf(c_0_16, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14, c_0_15])]), ['proof']). 1.24/0.62 # SZS output end CNFRefutation 1.24/0.62 # Parsed axioms : 11 1.24/0.62 # Removed by relevancy pruning/SinE : 7 1.24/0.62 # Initial clauses : 5 1.24/0.62 # Removed in clause preprocessing : 0 1.24/0.62 # Initial clauses in saturation : 5 1.24/0.62 # Processed clauses : 118 1.24/0.62 # ...of these trivial : 8 1.24/0.62 # ...subsumed : 17 1.24/0.62 # ...remaining for further processing : 93 1.24/0.62 # Other redundant clauses eliminated : 64 1.24/0.62 # Clauses deleted for lack of memory : 0 1.24/0.62 # Backward-subsumed : 3 1.24/0.62 # Backward-rewritten : 18 1.24/0.62 # Generated clauses : 1472 1.24/0.62 # ...of the previous two non-redundant : 1125 1.24/0.62 # ...aggressively subsumed : 0 1.24/0.62 # Contextual simplify-reflections : 0 1.24/0.62 # Paramodulations : 1179 1.24/0.62 # Factorizations : 9 1.24/0.62 # NegExts : 0 1.24/0.62 # Equation resolutions : 284 1.24/0.62 # Disequality decompositions : 0 1.24/0.62 # Total rewrite steps : 785 1.24/0.62 # ...of those cached : 599 1.24/0.62 # Propositional unsat checks : 0 1.24/0.62 # Propositional check models : 0 1.24/0.62 # Propositional check unsatisfiable : 0 1.24/0.62 # Propositional clauses : 0 1.24/0.62 # Propositional clauses after purity: 0 1.24/0.62 # Propositional unsat core size : 0 1.24/0.62 # Propositional preprocessing time : 0.000 1.24/0.62 # Propositional encoding time : 0.000 1.24/0.62 # Propositional solver time : 0.000 1.24/0.62 # Success case prop preproc time : 0.000 1.24/0.62 # Success case prop encoding time : 0.000 1.24/0.62 # Success case prop solver time : 0.000 1.24/0.62 # Current number of processed clauses : 67 1.24/0.62 # Positive orientable unit clauses : 20 1.24/0.62 # Positive unorientable unit clauses: 0 1.24/0.62 # Negative unit clauses : 0 1.24/0.62 # Non-unit-clauses : 47 1.24/0.62 # Current number of unprocessed clauses: 943 1.24/0.62 # ...number of literals in the above : 2756 1.24/0.62 # Current number of archived formulas : 0 1.24/0.62 # Current number of archived clauses : 26 1.24/0.62 # Clause-clause subsumption calls (NU) : 368 1.24/0.62 # Rec. Clause-clause subsumption calls : 368 1.24/0.62 # Non-unit clause-clause subsumptions : 19 1.24/0.62 # Unit Clause-clause subsumption calls : 30 1.24/0.62 # Rewrite failures with RHS unbound : 0 1.24/0.62 # BW rewrite match attempts : 70 1.24/0.62 # BW rewrite match successes : 22 1.24/0.62 # Condensation attempts : 118 1.24/0.62 # Condensation successes : 16 1.24/0.62 # Termbank termtop insertions : 249139 1.24/0.62 # Search garbage collected termcells : 212 1.24/0.62 1.24/0.62 # ------------------------------------------------- 1.24/0.62 # User time : 0.117 s 1.24/0.62 # System time : 0.014 s 1.24/0.62 # Total time : 0.131 s 1.24/0.62 # Maximum resident set size: 1868 pages 1.24/0.62 1.24/0.62 # ------------------------------------------------- 1.24/0.62 # User time : 0.596 s 1.24/0.62 # System time : 0.051 s 1.24/0.62 # Total time : 0.647 s 1.24/0.62 # Maximum resident set size: 1716 pages 1.24/0.62 % E---3.1 exiting 1.24/0.62 % E exiting 1.24/0.62 EOF